Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Umadevi, S.
- Built-In Self Test and Self-Repairing Circuit for Array Multipliers
Abstract Views :180 |
PDF Views:0
Authors
Jins Alex
1,
S. Umadevi
1
Affiliations
1 Department of SENSE, VIT University, Chennai Campus, Chennai - 600 048, Tamil Nadu, IN
1 Department of SENSE, VIT University, Chennai Campus, Chennai - 600 048, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 19 (2015), Pagination:Abstract
Background/Objectives: As the size of the chip reduces, nanoscale devices have become more susceptible to manufacturing faults, interference from radiations and transient faults. Many of these errors are not permanent but it causes malfunctioning of circuit either due to the complexity of the circuit or due to the interaction with the software. In this paper, an area and power efficient BIST with self repairing technique has been proposed, which detect and repair the faults in the circuit. Methods/Statistical Analysis: In this research work, a novel Built-In Self-Test (BIST) architecture with self repairing circuit is proposed. The novelty of this architecture is that testing is done along with the self repairing. The Self repairing circuit repairs the fault in the circuit during testing phase itself which increases the reliability of the circuit. Since the insertion of test pattern externally, BIST architecture does not alter the basic multiplier structure. Findings: Average power dissipation of the proposed Built-in self test and self repairing of array multiplier architecture is reduced by 36% since the use of a power efficient test pattern generator. Self repairing has been accomplished by the use of hardware redundancy technique. Also a TMR based self repairing architecture for real time self repairing has been proposed and its area and power dissipation is compared with the other self repairing architecture. Result shows that the BIST with repairing technique is good for low power applications while the TMR based self repairing method is good for real time self repairing applications. The proposed technique can be extended to self repairing processor.Keywords
Array Multipliers, BIST, DMR, Low Power, TMR- Implementation of Fast Radix-10 BCD Multiplier in FPGA
Abstract Views :154 |
PDF Views:0
Authors
Affiliations
1 School of Electronics Engineering (VLSI Design), VIT Chennai Campus, Chennai - 600127, Tamil Nadu, IN
1 School of Electronics Engineering (VLSI Design), VIT Chennai Campus, Chennai - 600127, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 19 (2015), Pagination:Abstract
Background: Multiplication is the basic operation in any signal processing systems and financial applications, all these applications requires multiplication to be performed in a faster and efficient manner on a silicon chip. Methods: This paper describes the algorithm and architecture of a BCD parallel multiplier. The design exploits two properties of redundant BCD codes to speed up its computation. Namely, the redundant BCD excess-3 code (XS-3), and the overloaded BCD representation (ODDS). In addition to this, number of new techniques are used in order to reduce significantly latency, area and for implementation on FPGA compared to existing implementations. Findings: Parallel architecture is used for generating partial products using radix-10 recoding technique for signed-digit of a BCD multiplier having set of digits between the range [–5, 5] and a positive set of multiplicand multiples coded in XS-3. Use of this encoding has various advantages like, as XS-3 is a self-complementing code, finding a negative of it is by just complementing the bits of respective number. Also the redundancy in XS-3 code is utilized for generating multiplicand multiples in a simple, faster and a carry-free way. Implemented design has three stages. Partial product generation, reduction and final conversion to BCD. For to implement the design in hardware the partial product reduction architecture is modified here to use a bank of ripple carry adder trees. ODDS representation uses 4-bit binary encoding technique which is similar to non-redundant BCD code, for this reason conventional VLSI circuit techniques such as carry-save adders and compression trees can be used effectively to perform operations on decimal numbers. Conclusion: To show the advantages of the resulted design, RTL model for 8 × 8-digit and 16 × 16-digits multiplication has been synthesized and implemented in Virtex-5 FPGA device. Results shows that the multiplier is about 10–15% delay efficient with existing work and about 14–18% area efficient.Keywords
Excess-3, FPGA, ODDS, Overloaded BCD, Radix-10 Multiplication- Realization of Low Power FIR Digital Filter using Modified DA-based Architecture
Abstract Views :176 |
PDF Views:0
Authors
Affiliations
1 School of Electronics Engineering, VIT University, Chennai Campus, Chennai-600127, Tamil Nadu, IN
1 School of Electronics Engineering, VIT University, Chennai Campus, Chennai-600127, Tamil Nadu, IN